def fibo(n):
    """递归实现斐波那契数列"""
    if n <= 0:
        return []
    elif n == 1:
        return [0]
    elif n == 2:
        return [0, 1]
    else:
        sequence = fibo(n-1)
        sequence.append(sequence[-1] + sequence[-2])
        return sequence

# 当模块被导入时自动打印的语句
print("I am mymoudloe.py, let`s dance!")